RSK correspondence and classically irreducible Kirillov–Reshetikhin crystals

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Octahedron Recurrence and Rsk-correspondence

Wemake the statement rigorous that the Robinson–Schensted–Knuth correspondence is a tropicalization of the Dodgson condensation rule.

متن کامل

Conditioned random walks and the RSK correspondence

We consider the stochastic evolution of three variants of the RSK algorithm, giving both analytic descriptions and probabilistic interpretations. Symmetric functions play a key role, and the probabilistic interpretations are obtained by elementary Doob–Hunt theory. In each case, the evolution of the shape of the tableau obtained via the RSK algorithm can be interpreted as a conditioned random w...

متن کامل

Kronecker products and the RSK correspondence

A matrix M with nonnegative integer entries is minimal if the nonincreasing sequence of its entries (called π-sequence) is minimal, in the dominance order of partitions, among all nonincreasing sequences of entries of matrices with nonnegative integers that have the same 1-marginals as A. The starting point for this work is an identity that relates the number of minimal matrices that have fixed...

متن کامل

Demazure Crystals of Generalized Verma Modules and a Flagged Rsk Correspondence

We prove that the Robinson-Schensted-Knuth correspondence is a gl∞-crystal isomorphism between two realizations of the crystal graph of a generalized Verma module with respect to a maximal parabolic subalgebra of gl∞. A flagged version of the RSK correspondence is derived in a natural way by computing a Demazure crystal graph of a generalized Verma module. As an application, we discuss a relati...

متن کامل

On the Lipschitz constant of the RSK correspondence

Article history: Received 22 December 2010 Available online xxxx

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2013

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2012.09.003